Radial projections of rectifiable sets

Information Theory on Rectifiable Sets

Entropy and—maybe even more so—mutual information are invaluable tools for analyzing properties of probability distributions, especially in coding theory. While there are general definitions for both concepts available for arbitrary probability distributions, these tend to be hard to work with and the literature (e.g., [CT06]) focuses on either discrete, or continuous random variables. In this ...

Non-rectifiable Limit Sets of Dimension One

Asymptotics of Best-packing on Rectifiable Sets

We investigate the asymptotic behavior, as N grows, of the largest minimal pairwise distance of N points restricted to an arbitrary compact rectifiable set embedded in Euclidean space, and we find the limit distribution of such optimal configurations. For this purpose, we compare best-packing configurations with minimal Riesz s-energy configurations and determine the s-th root asymptotic behavi...

Big Piece approximations of Uniformly rectifiable sets

This talk will give a short introduction of how one may put a “dyadic cube” structure on spaces of homogeneous type (see Coifman-Weiss ’77) and how when this dyadic cube structure is coupled with the Whitney decomposition it allows one to construct approximating NTA domains for uniformly rectifiable (UR) sets. (The term uniformly rectifiable is quantitative, scale invariant version of rectifiab...

Asymptotics of weighted best-packing on rectifiable sets

We investigate the asymptotic behaviour, as N grows, of the largest minimal weighted pairwise distance between N points restricted to a rectifiable compact set embedded in Euclidean space, and we find the limit distribution of asymptotically optimal configurations. Bibliography: 23 titles. The classical best-packing problem is the problem of finding a configuration of N points on a given compac...